An Algebra for Inductive Query Evaluation
نویسندگان
چکیده
Inductive queries are queries that generate pattern sets. This paper studies properties of boolean inductive queries, i.e. queries that are boolean expressions over monotonic and anti-monotonic constraints. More specifically, we introduce and study algebraic operations on the answer sets of such queries and show how these can be used for constructing and optimizing query plans. Special attention is devoted to the dimension of the queries, i.e. the minimum number of version spaces needed to represent the answer sets. The framework has been implemented for the pattern domain of strings and experimentally validated.
منابع مشابه
Induction of Relational Algebra Expressions
In the theory of database systems [1], a database query is defined as a function that maps relational databases to relations. This definition models the situation in practice where one applies an SQL query to a database instance and receives a set of output tuples as the answer to the query on that database. The problem of relational database query induction is then naturally stated as follows:...
متن کاملTowards Query Evaluation in Inductive Databases Using Version Spaces
An inductive query specifies a set of constraints that patterns should satisfy. We study a novel type of inductive query that consists of arbitrary boolean expressions over monotonic and anti-monotonic primitives. One such query asks for all patterns that have a frequency of at least 50 on the positive examples and of at most 3 on the negative examples. We investigate the properties of the solu...
متن کاملThe Preference SQL System - An Overview
Preference SQL is a declarative extension of standard SQL by strict partial order preferences, behaving like soft constraints under the BMO query model. Preference queries can be formulated intuitively following an inductive constructor-based approach. Both qualitative methods like e.g. Pareto / skyline and quantative methods like numerical ranking, definable over categorical as well as numeric...
متن کاملA Theory of Inductive Query Answering
We introduce the boolean inductive query evaluation problem, which is concerned with answering inductive queries that are arbitrary boolean expressions over monotonic and anti-monotonic predicates. Secondly, we develop a decomposition theory for inductive query evaluation in which a boolean query Q is reformulated into k sub-queries Qi = QA ^ QM that are the conjunction of a monotonic and an an...
متن کاملChapter 2 CONSTRAINT - BASED DATA MINING
Knowledge Discovery in Databases (KDD) is a complex interactive process. The promising theoretical framework of inductive databases considers this is essentially a querying process. It is enabled by a query language which can deal either with raw data or patterns which hold in the data. Mining patterns turns to be the so-called inductive query evaluation process for which constraint-based data ...
متن کامل